package A1_数组;

public class LC_704二分查找 {

    public static int search(int[] nums, int target) {
        int left=0,right=nums.length-1;
        while(left<=right){
            int middle=(left+right)/2;//注意middle要写在循环里面
            if(nums[middle]>target)
                right=middle-1;
            else if(nums[middle]<target)
                left=middle+1;
            else
                return middle;
        }
        return -1;
    }
}
